Uniqueness Analysis of Array Comprehensions
نویسنده
چکیده
In this paper we introduce the uniqueness problem of array comprehensions. An array comprehension has the uniqueness property if it deenes each array element at most once. Uniqueness is a necessary condition for the correctness of single assignment languages such as Haskell, Id, and Sisal. The uniqueness problem can be stated as a data dependence problem, which in itself can be reformulated as an integer linear programming problem. We derive algorithms to solve this problem using the Omega test, an Integer Linear Programming tool.
منابع مشابه
Uniqueness Analysis of Array Comprehensions Using the Omega Test Uniqueness Analysis of Array Comprehensions Using the Omega Test 1
In this paper we introduce the uniqueness problem of array comprehensions. An array comprehension has the uniqueness property if it de nes each array element at most once. Uniqueness is a necessary condition for the correctness of single assignment languages such as Haskell, Id, and Sisal. The uniqueness problem can be stated as a data dependence problem, which in itself can be reformulated as ...
متن کاملUniqueness and Completeness Analysis of Array Comprehensions Uniqueness and Completeness Analysis of Array Comprehensions 1
In this paper we introduce the uniqueness and completeness problems of array comprehensions. An array comprehension has the uniqueness property if it deenes each array element at most once. Uniqueness is a necessary condition for correctness in single assignment languages such as Haskell, Id, and Sisal. The uniqueness problem can be stated as a data dependence problem, which in itself can be re...
متن کاملDepartment of Computer Science Uniqueness and Completeness Analysis of Array Comprehensions
In this paper we introduce the uniqueness and completeness problems of array comprehensions. An array comprehension has the uniqueness property if it de nes each array element at most once. Uniqueness is a necessary condition for correctness in single assignment languages such as Haskell, Id, and Sisal. The uniqueness problem can be stated as a data dependence problem, which in itself can be re...
متن کاملUniqueness and Completeness Analysis of Array Comprehensions
In this paper we introduce the uniqueness and completeness problems of array comprehensions. An array comprehension has the uniqueness property if it deenes each array element at most once. Uniqueness is a necessary condition for correctness in single assignment languages such as Haskell, Id, and Sisal. The uniqueness problem can be stated as a data dependence problem, which in itself can be re...
متن کاملMode Analysis of Arrays and Array Comprehensions
A scheme is presented to enable the mode analysis of concurrent logic programs manipulating arrays containing both ground and non-ground elements. To do this we leverage constraint-propagation mode analysis techniques. The key ideas are to restrict multiple assignments only to variables at the leaves of paths, and to extend the language family with memo comprehensions. The result is a language ...
متن کامل